高光谱成像用高帧频CMOS图像传感器北大核心

针对高帧频、全局曝光和光谱平坦等成像应用需求,设计了一款高光谱成像用CMOS图像传感器。其光敏元采用PN型光电二极管,读出电路采用5T像素结构。采用列读出电路以及高速多通道模拟信号并行读出的设计方案来获得低像素固定图像噪声(FPN)和非均匀性抑制。芯片采用ASMC 0.35μm三层金属两层多晶硅标准CMOS工艺流片,为了抑制光电二极管的光谱干涉效应,后续进行了光谱平坦化VAE特殊工艺,并对器件的光电性能进行了测试评估。电路测试结果符合理论设计预期,成像效果良好,像素具备积分可调和全局快门功能,最终实现的像素规模为512×256,像元尺寸为30μm×30μm,最大满阱电子为400 ke^(-),FPN小于0.2%,动态范围为72 dB,帧频为450 f/s,相邻10 nm波段范围内量子效率相差小于10%,可满足高光谱成像系统对CMOS成像器件的要求。     

Grid Search for Predicting Coronary Heart Disease by Tuning Hyper-Parameters

Diagnosing the cardiovascular disease is one of the biggest medical difficulties in recent years. Coronary cardiovascular (CHD) is a kind of heart and blood vascular disease. Predicting this sort of cardiac illness leads to more precise decisions for cardiac disorders. Implementing Grid Search Optimization (GSO) machine training models is therefore a useful way to forecast the sickness as soon as possible. The state-of-the-art work is the tuning of the hyperparameter together with the selection of the feature by utilizing the model search to minimize the false-negative rate. Three models with a cross-validation approach do the required task. Feature Selection based on the use of statistical and correlation matrices for multivariate analysis. For Random Search and Grid Search models, extensive comparison findings are produced utilizing retrieval, F1 score, and precision measurements. The models are evaluated using the metrics and kappa statistics that illustrate the three models’ comparability. The study effort focuses on optimizing function selection, tweaking hyperparameters to improve model accuracy and the prediction of heart disease by examining Framingham datasets using random forestry classification. Tuning the hyperparameter in the model of grid search thus decreases the erroneous rate achieves global optimization.     

基于深度EPG的智能导航平台建设

随着三网融合的大力推进以及双向互动业务的大力开展,运营商使用原有简单的EPG不足以支撑开展更多的增值业务,不能主动为用户推荐节目,不能为运营商带来新的收入机会。作为重要的创新能力支撑系统,介绍了江苏有线智能导航平台的设计与应用,为相关广电运营商提供一定的设计参考。     

Water crisis through the analytic of urban transformation: an analysis of Bangalore’s hydrosocial regimes

ABSTRACT

This paper explores intensified water crisis in Bangalore (or Bengaluru) in India by using the analytic of three hydrosocial regimes: the catchment-based regime, the hydraulic regime and the speculative urban regime. It uses a wide range of qualitative interviews, scientific reports and secondary sources to analyze shifting urban trajectories, agrarian relations and their interlinkages with water. Historical ruptures (in the realm of governance, urban growth and changing urban–rural dynamics) allow one to highlight the complex role of speculative logics that shape urban expansion and water scarcity.     

基于Word2Vec模型特征扩展的Web搜索结果聚类性能的改进

对于用户泛化和模糊的查询，将Web搜索引擎返回的列表内容聚类处理，便于用户有效查找感兴趣的内容。由于返回的列表由称为片段（snippet）的短文本组成，而传统的单词频率-逆文档频率（TF-IDF）特征选择模型不能适用于稀疏的短文本，使得聚类性能下降。一个有效的方法就是通过一个外部的知识库对短文本进行扩展。受到基于神经网络词表示方法的启发，提出了通过词嵌入技术的Word2Vec模型对短文本扩展，即采用Word2Vec模型的TopN个最相似的单词用于对片段（snippet）的扩展，扩展文档使得TF-IDF模型特征选择得到聚类性能的提高。同时考虑到通用性单词造成的噪声引入，对扩展文档的TF-IDF矩阵进行了词频权重修正。实验在两个公开数据集ODP239和SearchSnippets上完成，将所提方法和纯snippet无扩展的方法、基于Wordnet的特征扩展方法和基于Wikipedia的特征扩展方法进行了对比。实验结果表明，所提方法在聚类性能方面优于对比方法。     

基于k-shell的复杂网络最短路径近似算法

复杂网络最短路径经典算法的处理效率较低，不适用于大规模复杂网络，而现有近似算法通用性有限，且计算准确率不理想，不能满足规模日益扩大的复杂网络中的最短路径计算需求。针对于此，提出基于[k]-shell的复杂网络最短路径近似算法。算法利用节点的[k]-shell值进行网络划分并引导搜索路径，利用超点聚合处理[k]-shell子网来降低路径搜索中节点和连边的规模，通过在路径搜索过程使用双向搜索树方法提高算法的计算效率和准确率。实验结果表明，算法通用性较好，在现实与仿真大规模复杂网络中均具有较高的计算效率和准确率。     

An improved cuckoo search algorithm for the problem of electric distribution network reconfiguration

Power loss reduction has an important role in operating electric distribution network system. There are a lot of methods for reduction power loss such as capacitor placement, distributed generation placement and electric distribution network reconfiguration (EDNR). Among these methods, the EDNR is an efficient technique to reduce power loss due to without taking any costs. However, the EDNR problem is a nonlinear, discrete problem and lots of extreme points. Therefore, it is necessary to have efficient methods for solving the EDNR problem. In this paper, an improved cuckoo search algorithm (ICSA) is proposed for solving the EDNR problem. In which, based on disadvantages of exploration and exploitation process of cuckoo search algorithm (CSA) for solving the EDNR problem, a local search mechanism is added to exploit candidate solutions existing around the current best solution. The calculated results on the simple distribution networks to complex distribution networks show that ICSA has ability for finding the global optimal solution with much smaller iterations and better quality of obtained solution compared with CSA and some other improved versions of CSA. The performance comparisons with other existing methods available in previous studies and the software of Power System Simulator/Advanced Distribution Engineering Productivity Tool (PSS/ADEPT) also lead to the better electric distribution network configuration with smaller total power losses. As a result, ICSA is a potential and reliable method for solving the EDNR problems.     

Classic and inverse compositional Gauss-Newton in global DIC

Today, effective implementations of digital image correlation (DIC) are based on iterative algorithms with constant linear operators. A relevant idea of the classic finite element (or, more generally, global) DIC solver consists in replacing the gradient of the deformed state image with that of the reference image, so as to obtain a constant operator. Different arguments (small strains, small deformations, equality of the two gradients close to the solution, etc) have been given in the literature to justify this approximation, but none of them are fully accurate. Indeed, the convergence of the optimization algorithm has to be investigated from its ability to produce descent directions. Through such a study, this paper attempts to explain why this approximation works and what is its domain of validity. Then, an inverse compositional Gauss-Newton implementation of finite element DIC is proposed as a cost-effective and mathematically sound alternative to this approximation.     

On global Hessenberg based methods for solving Sylvester matrix equations

In the first part of this paper, we investigate the use of Hessenberg-based methods for solving the Sylvester matrix equation $AX+XB=C$. To achieve this goal, the Sylvester form of the global generalized Hessenberg process is presented. Using this process, different methods based on a Petrov–Galerkin or on a minimal norm condition are derived. In the second part, we focus on the SGl-CMRH method which is based on the Sylvester form of the Hessenberg process with pivoting strategy combined with a minimal norm condition. In order to accelerate the SGl-CMRH method, a preconditioned framework of this method is also considered. It includes both fixed and flexible variants of the SGl-CMRH method. Moreover, the connection between the flexible preconditioned SGl-CMRH method and the fixed one is studied and some upper bounds for the residual norm are obtained. In particular, application of the obtained theoretical results is investigated for the special case of solving linear systems of equations with several right-hand sides. Finally, some numerical experiments are given in order to evaluate the effectiveness of the proposed methods.     

Hierarchical sampling optimization of particle filter for global robot localization in pervasive network environment

This paper presents a hierarchical framework for managing the sampling distribution of a particle filter (PF) that estimates the global positions of mobile robots in a large‐scale area. The key concept is to gradually improve the accuracy of the global localization by fusing sensor information with different characteristics. The sensor observations are the received signal strength indications (RSSIs) of Wi‐Fi devices as network facilities and the range of a laser scanner. First, the RSSI data used for determining certain global areas within which the robot is located are represented as RSSI bins. In addition, the results of the RSSI bins contain the uncertainty of localization, which is utilized for calculating the optimal sampling size of the PF to cover the regions of the RSSI bins. The range data are then used to estimate the precise position of the robot in the regions of the RSSI bins using the core process of the PF. The experimental results demonstrate superior performance compared with other approaches in terms of the success rate of the global localization and the amount of computation for managing the optimal sampling size.